منابع مشابه
On Classical and Quantum MDS-Convolutional BCH Codes
Several new families of multi-memory classical convolutional Bose-Chaudhuri-Hocquenghem (BCH) codes as well as families of unit-memory quantum convolutional codes are constructed in this paper. Our unit-memory classical and quantum convolutional codes are optimal in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are perf...
متن کاملOn Quantum BCH Codes and Its Duals
Classical Bose-Chaudhuri-Hocquenghem (BCH) codes C that contain their dual codes can be used to construct quantum stabilizer codes this chapter studies the properties of such codes. It had been shown that a BCH code of length n which contains its dual code satisfies the bound on weight of any non-zero codeword in C and converse is also true. One impressive difficulty in quantum communication an...
متن کاملQuantum Bch Codes
After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model—the quantum erasure channel—is discussed. Finally, parameters of quantum BCH codes are provided.
متن کاملConstructions of new families of nonbinary asymmetric quantum BCH codes and subsystem BCH codes
Two code constructions generating new families of good nonbinary asymmetric quantum BCH codes and good nonbinary subsystem BCH codes are presented in this paper. The first one is derived from q-ary Steane’s enlargement of CSS codes applied to nonnarrow-sense BCH codes. The second one is derived from the method of defining sets of classical cyclic codes. The asymmetric quantum BCH codes and subs...
متن کاملSome Hermitian Dual Containing BCH Codes and New Quantum Codes
Let q = 3l+2 be a prime power. Maximal designed distances of imprimitive Hermitian dual containing q2-ary narrow-sense (NS) BCH codes of length n = (q 6−1) 3 and n = 3(q 2 −1)(q2 +q+1) are determined. For each given n, non-narrow-sense (NNS) BCH codes which achieve such maximal designed distances are presented, and a series of NS and NNS BCH codes are constructed and their parameters are comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2007
ISSN: 0018-9448
DOI: 10.1109/tit.2006.890730